The Complexity of Finite Functions
نویسندگان
چکیده
This paper surveys the recent results on the complexity of Boolean functions in terms of Boolean circuits, formulas, and branching programs. The primary aim is to give accessible proofs of the more di cult theorems proving lower bounds on the complexity of speci c functions in restricted computational models. These include bounded depth circuits, monotone circuits, and bounded width branching programs. Application to other areas are described including Turing machine complexity, relativization, and rst order de nability.
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملAdaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation
An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...
متن کاملA New Approach to the Study of Transverse Vibrations of a Rectangular Plate Having a Circular Central Hole
In this study, the analysis of transverse vibrations of rectangular plate with circular central hole with different boundary conditions is studied and the natural frequencies and natural modes of a rectangular plate with circular hole have been obtained. To solve the problem, it is necessary to use both Cartesian and polar coordinate system. The complexity of the method is to apply an appropria...
متن کاملTime-Discontinuous Finite Element Analysis of Two-Dimensional Elastodynamic Problems using Complex Fourier Shape Functions
This paper reformulates a time-discontinuous finite element method (TD-FEM) based on a new class of shape functions, called complex Fourier hereafter, for solving two-dimensional elastodynamic problems. These shape functions, which are derived from their corresponding radial basis functions, have some advantages such as the satisfaction of exponential and trigonometric function fields in comple...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کامل